Computational Video Editing Model based on Optimization with Constraint-Satisfaction
نویسندگان
چکیده
This paper presents a novel video editing model. In this model, a video is considered as a sequence of small boxes each of which has a length of 0.5 or 1 second, and editing is defined as the problem of filling each box with an appropriate shot. Each editing rule is implemented independently of the others, as an evaluation function or a constraint for choosing shots and arranging shots. This formalism enables easy and systematic editing investigation by including or excluding editing rules. We implemented this model in an actual video editing system and verified its usefulness for multi-angled videos.
منابع مشابه
Video Contents Acquisition and Editing for Conversation Scene
This paper introduces a novel method for capturing conversation scenes and editing of the obtained videos. This system aims to acquire high-quality videos and to utilize them for multimedia that provides conversation functions. First, a video capturing system composed of “environmental camera module” and “contents capturing camera modules” is introduced. Next, a novel computational video editin...
متن کاملMotion History Volume for Spatiotemporal Editing of 3D Video in Multi-party Interaction Scenes
In this paper we present a novel method that performs spatiotemporal editing of 3D multi-party interaction scenes for free-viewpoint browsing, from separately captured data. The main idea is to first propose the augmented Motion History Volume (MHV) for motion representation. Then by modeling the correlations between different MHVs we can define a multi-party interaction dictionary, describing ...
متن کاملA New Optimization Model for Designing Acceptance Sampling Plan Based on Run Length of Conforming Items
The purpose of this article is to present an optimization model for designing an acceptance sampling plan based on cumulative sum of run length of conforming items. The objective is to minimize the total loss including both the producer and consumer losses. The concept of minimum angle method is applied to consider producer and consumer risks in the optimization model. Also the average number o...
متن کاملConstraint-Based Combinators for Local Search
One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates that traditional combinators from constraint programming have natural counterparts for local search, although their underlying computational model is radically different. In particular, the paper shows that constraint combinator...
متن کاملAn Empirical Study on Collective Intelligence Algorithms for Video Games Problem-Solving
Computational intelligence (CI), such as evolutionary computation or swarm intelligence methods, is a set of bio-inspired algorithms that have been widely used to solve problems in areas like planning, scheduling or constraint satisfaction problems. Constrained satisfaction problems (CSP) have taken an important attention from the research community due to their applicability to real problems. ...
متن کامل